Poisson convergence and poisson processes with applications to random graphs
نویسندگان
چکیده
منابع مشابه
Poisson convergence and random graph
1. Introduction Approximation by the Poisson distribution arises naturally in the theory of random graphs, as in many other fields, when counting the number of occurrences of individually rare and unrelated events within a large ensemble. For example, one may be concerned with the number of times that a particular small configuration is repeated in a large graph, such questions being considered...
متن کاملNumerical solution and simulation of random differential equations with Wiener and compound Poisson Processes
Ordinary differential equations(ODEs) with stochastic processes in their vector field, have lots of applications in science and engineering. The main purpose of this article is to investigate the numerical methods for ODEs with Wiener and Compound Poisson processes in more than one dimension. Ordinary differential equations with Ito diffusion which is a solution of an Ito stochastic differentia...
متن کاملPoisson sphere counting processes with random radii
Abstract We consider a random sphere covering model made of random balls with interacting random radii of the product form R(r, ω) = rG(ω), based on a Poisson random measure ω(dy, dr) on IR×IR+. We provide sufficient conditions under which the corresponding random ball counting processes are well-defined, and we study the fractional behavior of the associated random fields. The main results rel...
متن کاملMartin-Löf random generalized Poisson processes
Martin-Löf randomness was originally defined and studied in the context of the Cantor space 2ω . In [1] probability theoretic random closed sets (RACS) are used as the foundation for the study of Martin-Löf randomness in spaces of closed sets. Here we focus on the space of closed subsets of R and a particular family of measures on this space, the generalized Poisson processes. This gives a nove...
متن کاملPoisson cloning model for random graphs
In the random graph G(n, p) with pn bounded, the degrees of the vertices are almost i.i.d. Poisson random variables with mean λ := p(n− 1). Motivated by this fact, we introduce the Poisson cloning model GPC(n, p) for random graphs in which the degrees are i.i.d. Poisson random variables with mean λ. We first establish a theorem that shows that the new model is equivalent to the classical model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1987
ISSN: 0304-4149
DOI: 10.1016/0304-4149(87)90048-2